The Szegö kernel on a class of non-compact CR manifolds of high codimension

We generalize Nagel’s formula for the Szegö kernel and use it to compute the Szegö kernel on a class of non-compact CR manifolds whose tangent space decomposes into one complex direction and several totally real directions. We also discuss the control metric on these manifolds and relate it to the size of the Szegö kernel.     

Multi-variable special polynomials using an operator ordering method

Using an operator ordering method for some commutative superposition operators, we introduce two new multi-variable special polynomials and their generating functions, and present some new operator identities and integral formulas involving the two special polynomials. Instead of calculating complicated partial differential, we use the special polynomials and their generating functions to concisely address the normalization, photocount distributions and Wigner distributions of several quantum states that can be realized physically, the results of which provide real convenience for further investigating the properties and applications of these states.     

The connected partition lattice of a graph and the reconstruction conjecture

Previously we showed that many invariants of a graph can be computed from its abstract induced subgraph poset, which is the isomorphism class of the induced subgraph poset, suitably weighted by subgraph counting numbers. In this paper, we study the abstract bond lattice of a graph, which is the isomorphism class of the lattice of distinct unlabelled connected partitions of a graph, suitably weighted by subgraph counting numbers. We show that these two abstract posets can be constructed from each other except in a few trivial cases. The constructions rely on certain generalisations of a lemma of Kocay in graph reconstruction theory to abstract induced subgraph posets. As a corollary, trees are reconstructible from their abstract bond lattice. We show that the chromatic symmetric function and the symmetric Tutte polynomial of a graph can be computed from its abstract induced subgraph poset. Stanley has asked if every tree is determined up to isomorphism by its chromatic symmetric function. We prove a counting lemma, and indicate future directions for a study of Stanley's question.     

On the boomerang uniformity of a class of permutation quadrinomials over finite fields

Let ${\mathbb{F}}_{2^n}$ be a finite field with $2^n$ elements and $f_{\underset{\_}{c}}(x)=c_0{x}^{2^m(2^k+1)}+c_1{x}^{2^{m+k}+1}+c_2{x}^{2^m+2^k}+c_3{x}^{2^k+1}\in {\mathbb{F}}_{2^n}[x]$, where n, m and k are positive integers with $n=2m$ and $\gcd ?(m,k)=e$. In this paper, motivated by a recent work of Li, Xiong and Zeng (Li et al. (2021) [12]), we further study the boomerang uniformity of $f_{\underset{\_}{c}}(x)$ by using similar ideas and carrying out particular techniques in solving equations over finite fields. As a consequence, we generalize Li, Xiong and Zeng's result from the case of m being odd and $e=1$ to that of both $m/e$ and $k/e$ being odd.     

Hermitian adjacency matrix of the second kind for mixed graphs

This contribution gives an extensive study on spectra of mixed graphs via its Hermitian adjacency matrix of the second kind (N-matrix for short) introduced by Mohar [25]. This matrix is indexed by the vertices of the mixed graph, and the entry corresponding to an arc from u to v is equal to the sixth root of unity $\omega =\frac{1+\mathbf{i}\sqrt{3}}{2}$ (and its symmetric entry is $\overline{\omega }=\frac{1?\mathbf{i}\sqrt{3}}{2}$); the entry corresponding to an undirected edge is equal to 1, and 0 otherwise. The main results of this paper include the following: equivalent conditions for a mixed graph that shares the same spectrum of its N-matrix with its underlying graph are given. A sharp upper bound on the spectral radius is established and the corresponding extremal mixed graphs are identified. Operations which are called two-way and three-way switchings are discussed–they give rise to some cospectral mixed graphs. We extract all the mixed graphs whose rank of its N-matrix is 2 (resp. 3). Furthermore, we show that if $M_G$ is a connected mixed graph with rank 2, then $M_G$ is switching equivalent to each connected mixed graph to which it is cospectral. However, this does not hold for some connected mixed graphs with rank 3. We identify all mixed graphs whose eigenvalues of its N-matrix lie in the range $(?\alpha ,\alpha )$ for $\alpha \in \{\sqrt{2},\sqrt{3},2\}$.     

Development and assessment of an intrusive polynomial chaos expansion-based continuous adjoint method for shape optimization under uncertainties

This article contributes to the development of methods for shape optimization under uncertainties, associated with the flow conditions, based on intrusive Polynomial Chaos Expansion (iPCE) and continuous adjoint. The iPCE to the Navier–Stokes equations for laminar flows of incompressible fluids is developed to compute statistical moments of the Quantity of Interest which are, then, compared with those obtained through the Monte Carlo method. The optimization is carried out using a continuous adjoint-enabled, gradient-based loop. Two different formulations for the continuous adjoint to the iPCE PDEs are derived, programmed, and verified. Intrusive PCE methods for the computation of the statistical moments require mathematical development, derivation of a new system of governing equations and their numerical solution. The development is presented for a chaos order of two and two uncertain variables and can be used as a guide to those willing to extend this development to a different set of uncertain variables or chaos order. The developed method and software, programmed in OpenFOAM, is applied to two optimization problems pertaining to the flow around isolated airfoils with uncertain farfield conditions.